Plotting in a Formally Verified Way

نویسندگان

چکیده

An invaluable feature of computer algebra systems is their ability to plot the graph functions. Unfortunately, when one trying design a library mathematical functions, this often falls short, producing incorrect and potentially misleading plots, due accuracy issues inherent use case. This paper investigates what it means for be correct how formally verify property. The Coq proof assistant then turned into tool plotting function graphs using reliable polynomial approximations. provided as part CoqInterval library.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Formally-Verified Alias Analysis

This paper reports on the formalization and proof of soundness, using the Coq proof assistant, of an alias analysis: a static analysis that approximates the flow of pointer values. The alias analysis considered is of the points-to kind and is intraprocedural, flow-sensitive, field-sensitive, and untyped. Its soundness proof follows the general style of abstract interpretation. The analysis is d...

متن کامل

Formally Verified Modular Semantics

This chapter presents the results of the validation and verification of a crucial component of BOS, a large safety-critical system that decides when to close and open the Maeslantkering, a storm surge barrier near the city of Rotterdam in the Netherlands. BOS was specified in the formal language Z and model checking has been applied to some of its subsystems during its development. A lightweigh...

متن کامل

Formally Verified System Initialisation

The safety and security of software systems depends on how they are initially configured. Manually writing program code that establishes such an initial configuration is a tedious and error-prone engineering process. In this paper we present an automatic and formally verified initialiser for component-based systems built on the general-purpose microkernel seL4. The construction principles of th...

متن کامل

A Simple Supercompiler Formally Verified in Coq

We study an approach for verifying the correctness of a simplified supercompiler in Coq. While existing supercompilers are not very big in size, they combine many different program transformations in intricate ways, so checking the correctness of their implementation poses challenges. The presented method relies on two important technical features to achieve a compact and modular formalization:...

متن کامل

Formally Verified On-Line Diagnosis

A recon gurable fault tolerant system achieves the attributes of dependability of operations through fault detection fault isolation and recon guration typically referred to as the FDIR paradigm Fault diagnosis is a key component of this approach requiring an accurate deter mination of the health and state of the system An imprecise state assessment can lead to catastrophic failure due to an op...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic proceedings in theoretical computer science

سال: 2021

ISSN: ['2075-2180']

DOI: https://doi.org/10.4204/eptcs.338.6